import math
from collections import deque
n,m = map(int,input().split())
athletes = []
for i in range(m):
l,r,m,c = map(int,input().split())
athletes.append((l,r,m,c))
total = 0
for i in range(n):
sec = i + 1
fastest = None
for j in range(len(athletes)):
if athletes[j][0] <= sec and athletes[j][1] >= sec:
if fastest == None:
fastest = j
continue
if athletes[j][2] < athletes[fastest][2]:
fastest = j
if fastest == None:
continue
total += athletes[fastest][3]
print(total)
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |